Performance analysis of the error-forecasting decoding for interleaved block codes on Gilbert-Elliott channels

نویسنده

  • Katsumi Sakakibara
چکیده

This paper investigates the performance of the errorforecasting decoding for an interleaved block code on Gilbert–Elliott channels in terms of the word-error probability, which is the sum of the decoder error and failure probabilities. We derive expressions by constructing several Markov chains, starting from a two-state Markov chain of the Gilbert–Elliott channel model. The derived formulas are examined for an interleaved Reed–Solomon code on solid-density and moderate-density burst error channels. Numerical results indicate that the error-forecasting decoding can significantly improve the performance, particularly on solid-density burst error channels. The optimal depth of interleaving for the error-forecasting decoding is also numerically evaluated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance of Interleaved Non-Binary Block Codes Over Binary Channels with Memory

The performance of Reed-Solomon codes over two classes of binary channels with memory, the queue-based channel (QBC) and the Gilbert-Elliott channel (GEC) is analyzed under the assumption of bounded distance decoding. In particular, we examine two interleaving strategies encountered when dealing with non-binary codes over a binary channel; namely, symbol interleaving and bit interleaving. An an...

متن کامل

Performance Comparison of Symbol- and Bit-Interleaving of Block Codes over GF(2m) on Fading Channels

We analytically compare the word error probabilities of imperfectly symboland bit-interleaved block codes over GF(2m) on fading channels. We employ an approximate fading channel model of a two-state Markov chain, using statistics of the fadeand interfadedurations. The analytical method is based on a technique developed in [2]. Expressions are derived for two decoding strategies; independent bou...

متن کامل

Analysis of soft decision decoding of interleaved convolutional codes over burst channels

We study the performance of a decision feedback decoder (DFD) for convolutional codes over an interleaved burst channel. The DFD adaptively estimates channel reliability information from previous decisions. The effect of ermr propagation, finite interleaving and the length of the initial training sequence is explicitly studied. A binary Gilbert-Elliott channel is used to model the wmla t ion st...

متن کامل

Decoding LDPC Convolutional Codes on Markov Channels

This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveal...

متن کامل

Performance Analysis of Linear Block Codes Over the Queue-Based Channel

Most coding schemes used in today’s communication systems are designed for memoryless channels. These codes break down when they are transmitted over channels with memory, which is in fact what real-world channels look like since errors often occur in bursts. Therefore, these systems employ interleaving to spread the errors so that the channel looks more or less memoryless (for the decoder) at ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Communications

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2000